Multiple Strategies Boosted Orca Predation Algorithm for Engineering Optimization Problems
نویسندگان
چکیده
Abstract This paper proposes an enhanced orca predation algorithm (OPA) called the Lévy flight (LFOPA). LFOPA improves OPA by integrating (LF) strategy into chasing phase of and employing greedy selection (GS) at end each optimization iteration. enhancement is made to avoid entrapment local optima improve quality acquired solutions. a novel, efficient population-based optimizer that surpasses other reliable optimizers. However, owing low diversity orcas, prone stalling in some scenarios. In this paper, proposed for addressing global real-world challenges. To investigate validity LFOPA, it compared with seven robust optimizers, including improved multi-operator differential evolution (IMODE), covariance matrix adaptation (CMA-ES), gravitational search (GSA), grey wolf (GWO), moth-flame (MFO), Harris hawks (HHO), original on 10 unconstrained test functions linked 2020 IEEE Congress Evolutionary Computation (CEC’20). Furthermore, four different design engineering issues, welded beam, tension/compression spring, pressure vessel, speed reducer, are solved using its applicability. It was also employed address node localization challenges wireless sensor networks (WSNs) as example applications. Results tests significance show performs much better than competitors. simulation results superior competitors terms minimizing squared errors errors.
منابع مشابه
FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کاملFlying Squirrel Optimizer (FSO): A novel SI-based optimization algorithm for engineering problems
This paper provides a novel meta-heuristic optimization algorithm. The behaviors of flying squirrels in the nature are the main inspiration of this research. These behaviors include flying from tree to tree and walking on the ground or on a tree branch to find food. They also contact each other with chirp or squeak. This algorithm is named flying squirrel optimizer (FSO). Two main theories of m...
متن کاملSelf-Adaptive Spider Monkey Optimization Algorithm for Engineering Optimization Problems
Algorithms inspired by intelligent behavior of simple agents are very popular now a day among researchers. A comparatively young algorithm motivated by extraordinary behavior of Spider Monkeys is Spider Monkey Optimization (SMO) algorithm. SMO algorithm is very successful algorithm to get to the bottom of optimization problems. This work presents a self-adaptive Spider Monkey optimization (SaSM...
متن کاملAN EFFICIENT METAHEURISTIC ALGORITHM FOR ENGINEERING OPTIMIZATION: SOPT
Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2023
ISSN: ['1875-6883', '1875-6891']
DOI: https://doi.org/10.1007/s44196-023-00249-y